Subtraction makes computing integers faster
نویسندگان
چکیده
We show some facts regarding the question whether, for any number n, the length of the shortest Addition Multiplications Chain (AMC) computing n is polynomial in the length of the shortest division-free Straight Line Program (SLP) that computes n. If the answer to this question is “yes”, then we can show a stronger upper bound for PosSLP, the important problem which essentially captures the notion of efficient computation over the reals. If the answer is “no”, then this would demonstrate how subtraction helps generating integers super-polynomially faster, given that addition and multiplication can be done in unit time. In this paper, we show that, for almost all numbers, AMCs and SLPs need same asymptotic length for computation. However, for one specific form of numbers, SLPs are strictly more powerful than AMCs by at least one step of computation.
منابع مشابه
A generalization of the Lucas addition chains
In this paper, a generalization of Lucas addition chains, where subtraction is allowed, is given. It is called ”Lucas addition-subtraction chain” (LASC). LASC gives minimal addition-subtraction chains for infinitely many integers and will also be used to prove the optimality of Lucas addition chains for many cases. One of the main result in the theory of addition-subtraction chains is due to Vo...
متن کاملFaster Factoring of Integers of a Special
A speedup of Lenstra's Elliptic Curve Method of factorization is presented. The speedup works for integers of the form N = P Q 2 , where P is a prime suuciently smaller than Q. The result is of interest to cryptographers, since integers with secret factorization of this form are being used in digital signatures. The algorithm makes use of what we call \Jacobi signatures". We believe these to be...
متن کاملFactoring in Quadratic Fields
This is closed under addition, subtraction, multiplication, and also division by nonzero numbers. Similarly, set Z[ √ d] = {a+ b √ d : a, b ∈ Z}. This is closed under addition, subtraction, and multiplication, but not usually division. We will define a concept of “integers” for K, which will play the same role in K as the ordinary integers Z do in Q. The integers of K will contain Z[ √ d] but m...
متن کاملThe Algebraic Construction of Commutative Group
The construction of the integers introduced by Dedekind is an algebraic one. Subtraction can not be done without restriction in natural numbers N. If we consider the definition of multiplication of integral domain Z, N with respect to subtraction is needed. It is necessary to give the definition of subtraction in N. Instead of starting from natural numbers, one could begin with any commutative ...
متن کاملAn Aperiodic Subtraction Game of Nim-Dimension Two
In a recent manuscript, Fox studied infinite subtraction games with a finite (ternary) and aperiodic Sprague-Grundy function. Here we provide an elementary example of a game with the given properties, namely the game given by the subtraction set {F2n+1− 1}, where Fi is the ith Fibonacci number, and n ranges over the positive integers. Supported by the Killam Trust.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1212.2549 شماره
صفحات -
تاریخ انتشار 2012